Subspace decomposition based DNN algorithm for elliptic type multi-scale PDEs
نویسندگان
چکیده
While deep learning algorithms demonstrate a great potential in scientific computing, its application to multi-scale problems remains be big challenge. This is manifested by the “frequency principle” that neural networks tend learn low frequency components first. Novel architectures such as network (MscaleDNN) were proposed alleviate this problem some extent. In paper, we construct subspace decomposition based DNN (dubbed SD2NN) architecture for class of combining MscaleDNN with traditional numerical analysis ideas. The includes one normal submodule, and (or few) high submodule(s), which are designed capture smooth part oscillatory solutions simultaneously. We SD2NN outperforms existing models MscaleDNN, through several benchmark regular or perforated domains.
منابع مشابه
An iteratively adaptive multi-scale finite element method for elliptic PDEs with rough coefficients
Article history: Received 26 June 2015 Received in revised form 28 August 2016 Accepted 2 February 2017 Available online 9 February 2017
متن کاملVibration Signal Filtering Algorithm Based on Singular Value Subspace Decomposition
In the area of fault detect for rotating machinery, the vibration signal should be filtered before parameter detection and quality evaluation. For the filtering of the vibration signal, it is needed to keep the linear phase characteristics while obtaining good filtering effect. Aiming at the filtering problem of vibration signal, a filtering algorithm based on singular value subspace decomposit...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملNumerical Homogenization of Elliptic Multiscale Problems by Subspace Decomposition
Numerical homogenization tries to approximate solutions of elliptic partial differential equations with strongly oscillating coefficients by the solution of localized problems over small subregions. We develop and analyze a rapidly convergent iterative method for numerical homogenization that shares this feature with existing approaches and is modeled after the Schwarz method. The method is hig...
متن کاملDecomposition-based evolutionary algorithm for large scale constrained problems
Cooperative Coevolutionary algorithms (CC) have been successful in solving large scale optimization problems. The performance of CC can be improved by decreasing the number of interdependent variables among decomposed subproblems. This is achieved by first identifying dependent variables, and by then grouping them in common subproblems. This approach has potential because so far no grouping tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2023
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2023.112242